Spatial/kinematic domain and lattice computers

نویسندگان

  • John Case
  • Dayanand S. Rajan
  • Anil M. Shende
چکیده

An approach to analogical representation for objects and their motions in space is proposed. This approach involves lattice computer architectures and associated algorithms and is shown to be abstracted from the behavior of human beings mentally solving spatial/kinematic puzzles. There is also discussion of where in this approach the modeling of human cognition leaves o and the engineering begins. The possible relevance of the approach to a number of issues in Arti cial Intelligence is discussed. These issues include e ciency of sentential versus analogical representations, common sense reasoning, update propagation, learning performance tasks, diagrammatic representations, spatial reasoning, metaphor, human categorization, and pattern recognition. Lastly there is a discussion of the somewhat related approach involving cellular automata applied to computational physics.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spatial Resolution Enhancement in a 2D Photonic Crystal Based on Complex Square Lattice

We study the focusing properties of a two dimensional complex square-lattice photonic crystal (PC) comprising air holes immersed in Ge medium. The finite difference time domain (FDTD) method is utilized to calculate the dispersion band diagram and to simulate the image formation incorporating the perfectly matched layer (PML) boundary condition. In contrast to the common square PCs with the sam...

متن کامل

Exact artificial boundary conditions for a lattice Boltzmann method

When using a lattice Boltzmann method on an unbounded (or very large) domain one has to confine this spatial domain to a computational domain. This is realized by introducing so-called artificial boundary conditions. Until recently, characteristic boundary conditions for the Euler equations were considered and adapted to the lattice Boltzmann method. In this work we propose novel discrete artif...

متن کامل

Parallel Spatial Pyramid Match Kernel Algorithm for Object Recognition using a Cluster of Computers

This paper parallelizes the spatial pyramid match kernel (SPK) implementation. SPK is one of the most usable kernel methods, along with support vector machine classifier, with high accuracy in object recognition. MATLAB parallel computing toolbox has been used to parallelize SPK. In this implementation, MATLAB Message Passing Interface (MPI) functions and features included in the toolbox help u...

متن کامل

Domain walls of single-component Bose-Einstein condensates in external potentials

We demonstrate the possibility of creating domain walls described by a single component Gross–Pitaevskii equation with attractive interactions, in the presence of an optical–lattice potential. While it is found that the domain wall is unstable in an infinite system, we show that the external magnetic trap can stabilize it. Stable solutions also include “twisted” domain walls, as well as asymmet...

متن کامل

Spatial statistics for lattice points on the sphere I‎: ‎Individual results

‎We study the spatial distribution of point sets on the sphere obtained from the representation of a large integer as a sum of three integer squares‎. ‎We examine several statistics of these point sets‎, ‎such as the electrostatic potential‎, ‎Ripley's function‎, ‎the variance of the number of points in random spherical caps‎, ‎and the covering radius‎. ‎Some of the results are conditional on t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Exp. Theor. Artif. Intell.

دوره 6  شماره 

صفحات  -

تاریخ انتشار 1994